An Augmented Fast Marching Method for Computing Skeletons and Centerlines
نویسندگان
چکیده
We present a simple and robust method for computing skeletons for arbitrary planar objects and centerlines for 3D objects. We augment the Fast Marching Method (FMM) widely used in level set applications 11 by computing the paramterized boundary location every pixel came from during the boundary evolution. The resulting parameter field is then thresholded to produce the skeleton branches created by boundary features of a given size. The presented algorithm is straightforward to implement, has low memory costs and short execution times, and is robust with respect to the used threshold and initial shape noisiness. The produced skeletons are very similar to the ones delivered by more complex algorithms. Various 2D and 3D applications are presented.
منابع مشابه
Augmented Downhill Simplex a Modified Heuristic Optimization Method
Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...
متن کاملThe Augmented Fast Marching Method for Level Set Reinitialization∗
Including derivative information in the modelling of moving interfaces has been proposed as one method to increase the accuracy of numerical schemes with minimal additional cost. Here a new level set reinitialization technique using the fast marching method is presented. This augmented fast marching method will calculate the signed distance function and up to the secondorder derivatives of the ...
متن کاملA Robust Level-Set Algorithm for Centerline Extraction
We present a robust method for extracting 3D centerlines from volumetric datasets. We start from a 2D skeletonization method to locate voxels centered with respect to three orthogonal slicing directions. Next, we introduce a new detection criterion to extract the centerline voxels from the above skeletons, followed by a thinning, reconnection, and a ranking step. Overall, the proposed method pr...
متن کامل3D Multi-branch Tubular Surface and Centerline Extraction with 4D Iterative Key Points
An innovative 3D multi-branch tubular structure and centerline extraction method is proposed in this paper. In contrast to classical minimal path techniques that can only detect a single curve between two pre-defined initial points, this method propagates outward from only one initial seed point to detect 3D multi-branch tubular surfaces and centerlines simultaneously. First, instead of only re...
متن کاملFast Methods for Eikonal Equations: an Experimental Survey
The Fast Marching Method is a very popular algorithm to compute times-of-arrival maps (distances map measured in time units). Since their proposal in 1995, it has been applied to many different applications such as robotics, medical computer vision, fluid simulation, etc. Many alternatives have been proposed with two main objectives: to reduce its computational time and to improve its accuracy....
متن کامل